Search results for "Fast methods"
showing 2 items of 2 documents
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
2001
We describe algorithms for pattern-matching and pattern-learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite its apparent inefficiency, this approach yields an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a…
Management of Microbiological Quality of Meat in the Context of Rapid Tenderization
2018
Abstract This paper focuses on the study of the microbiological load of pork and beef meat, in the context of utilising fast methods of tenderizing them. The study highlights, through both classic and fast methods, the microbial load of fresh, salted and smoked pork and beef meat. It has been established that fresh pork is at around 7,2x104-8,5x104CFU/g, whereas fresh beef sits at around 2,3x103 CFU/g. For salted, smoked and classically tenderized, these values are between 3,3x104 CFU/g and 4,7x104CFU/g for pork and 6,1x102 CFU/g for beef. The method of rapid tenderizing leads to highlighting a decreased microbial load: 2,2x103 CFU/g-5,4x103CFU/g for pork, 2,8x102 CFU/g for beef, which cons…